Optimal Capacity Provisioning for Online Job Allocation With Hard Allocation Ratio Requirement
نویسندگان
چکیده
منابع مشابه
Optimal Capacity Provisioning for Online Job Allocation with Hard Allocation Ratio Requirement
The problem of allocating jobs to appropriate servers in cloud computing is studied in this paper. We consider that jobs of various types arrive in some unpredictable pattern and the system is required to allocate a certain ratio of jobs. In order to meet the hard allocation ratio requirement in the presence of unknown arrival patterns, one can increase the capacity of servers by expanding the ...
متن کاملa benchmarking approach to optimal asset allocation for insurers and pension funds
uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...
15 صفحه اولA SLA Framework for QoS Provisioning and Dynamic Capacity Allocation
Any QoS scheme must be designed from the perspective of pricing policies and service level agreements (SLAs). Although there has been enormous amount of research in designing mechanisms for delivering QoS, its applications has been limited due to the missing link between QoS, SLA and pricing. Therefore the pricing policies in practice are very simplistic (fixed price per unit capacity with fixe...
متن کاملOptimal Capacity Allocation for Sampled Networked Systems
We consider the problem of estimating the states of weakly coupled linear systems from sampled measurements. We assume that the total capacity available to the sensors to transmit their samples to a network manager in charge of the estimation is bounded above, and that each sample requires the same amount of communication. Our goal is then to find an optimal allocation of the capacity to the se...
متن کاملOptimal synchronous capacity allocation for hard real-time communications with the timed token protocol
We study the problem of guaranteeing synchronous message deadlines in communication networks where the timed token medium access control protocol is employed. Synchronous capacity, deened as the maximum time for which a node can transmit its synchronous messages every time it receives the token, is a key parameter in the control of synchronous message transmission. To ensure the transmission of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2018
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2018.2794394